Modeling Sequences within the RelView System

Modeling Sequen es within the RelView System

Computation of Cut Completions and Concept Lattices Using Relational Algebra and RelView

Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices. It is shown how the algorithms can be translated into the programming language of RelView and executed using this system. Furthermore, it is demonstrated how to obtain and draw Hasse diagrams of concept lattices as l...

Computing tournament solutions using relation algebra and RelView

We describe a simple computing technique for the tournament choice problem. It rests upon a relational modeling and uses the BDD-based computer system RelView for the evaluation of the relationalgebraic expressions that specify the solutions and for the visualization of the computed results. The Copeland set can immediately be identified using RelView’s labeling feature. Relation-algebraic spec...

RELVIEW - A System for Calculating With Relations and Relational Programming

The calculus of relational algebra has its roots in the second half of the last century with the pioneering work on binary relations of G. Boole, A. de Morgan, C.S. Peirce, and E. Schröder. The modern axiomatic development is due to A. Tarski and his co-workers. In the last two decades this formalization has been accepted by many mathematicians and computer scientists as a fruitful base for des...

Prototyping Relational Speciications and Programs with Relview

Based on the representation of relations as Boolean matrices, relational speciications { in our context relation algebraic terms { can be prototyped using the RELVIEW system. Transformational techniques allow to derive eecient programs from these relational speciications which again can be prototyped with RELVIEW. The powerful relational calculus can be used to prove required properties for ass...